Information flow in tabular interpretations for generalized push-down automata
نویسندگان
چکیده
منابع مشابه
Information Flow in Tabular Interpretations for Generalized Push-Down Automata
This paper presents a general framework for deriving tabular algorithms for a very large class of stack-based computations, not only in context-free parsing but in logic programming as well and more generally for all kinds of \information" domains (abstract domains, constraint domains). Tabular algorithms store traces of computations in a table to achieve computation sharing, which is most usef...
متن کاملSubsumption{oriented Push{down Automata ?
This paper presents Subsumption{oriented Push{Down Auto-mata (SPDA), a very general stack formalism used to describe forest (\AND{ OR" tree) traversals. These automata may be used for parsing or the interpretation of logic programs. SPDA allow a Dynamic Programming execution which breaks computations into combinable, sharable and storable sub{computations. They provide computation sharing and o...
متن کاملPush-Down Automata with Gap-Order Constraints
We consider push-down automata with data (PDAD) that operate on variables ranging over the set of natural numbers. The conditions on variables are defined via gap-order constraint. Gap-order constraints allow to compare variables for equality, or to check that the gap between the values of two variables exceeds a given natural number. The messages inside the stack are equipped with values that ...
متن کاملA redefinition of Embedded Push-Down Automata
A new definition of Embedded Push-Down Automata is provided. We prove this new definition preserves the equivalence with tree adjoining languages and we provide a tabulation framework to execute any automaton in polynomial time with respect to the length of the input string.
متن کاملLogical Embedded Push-Down Automata in Tree-Adjoining Grammar Parsing
This paper extends the “parsing as deduction” approach to tree-adjoining grammars by showing how a TAG recognition problem can be reduced to a Datalog deduction problem, and presents an SLD selection rule that makes the proof search correspond to a top-down parse using the original grammar. Just as in the DCG extension of context-free grammars, this approach permits nodes tn be labeled with fir...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1998
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(97)00272-7